Rule induction from noisy examples

نویسنده

  • Laura Firoiu
چکیده

This work addresses the problem of rule learning from simple robot experiences like approaching or passing an object. An experience is a sequence of predicates computed by a perceptual system. A difficult problem encountered in this domain by rule induction algorithms is that of noise, not only in the classification of the examples, but also in the facts describing them. Due to perceptual limitations and environment complexity, the descriptions of experiences may have either missing or spurious predicates. I propose a rule induction method based on generalization of clauses under subsumption which takes into consideration the frequency of predicates across examples. Preliminary results show that this method can handle noise effectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noise Elimination in Inductive Concept Learning: A Case Study in Medical Diagnosois

Compression measures used in inductive learners, such as measures based on the MDL (Minimum Description Length) principle, provide a theoretically justiied basis for grading candidate hypotheses. Compression-based induction is appropriate also for handling of noisy data. This paper shows that a simple compression measure can be used to detect noisy examples. A technique is proposed in which noi...

متن کامل

Using J-Pruning to Reduce Overfitting of Classification Rules in Noisy Domains

The automatic induction of classification rules from examples is an important technique used in data mining. One of the problems encountered is the overfitting of rules to training data. This paper describes a means of reducing overfitting known as J-pruning, based on the J-measure, an information theoretic means of quantifying the information content of a rule, and examines its effectiveness i...

متن کامل

Fast Eeective Rule Induction

Many existing rule learning systems are computationally expensive on large noisy datasets. In this paper we evaluate the recently-proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems. We show that while IREP is extremely eecient, it frequently gives error rates higher than those of C4.5 and C4.5rules. We then propose a number of modiications resulting in...

متن کامل

The BBG Rule Induction Algorithm

We present an algorithm (BBG) for inductive learning from examples that outputs a rule list. BBG uses a combination of greedy and branch-and-bound techniques, and naturally handles noisy or stochastic learning situations. We also present the results of an empirical study comparing BBG with Quinlan's C4.5 on 1050 synthetic data sets. We nd that BBG greatly outperforms C4.5 on rule-oriented probl...

متن کامل

Improving the Performance of a Rule Induction System Using Genetic Algorithms

Concept acquisition is a form of inductive learning that induces general descriptions of concepts from specific instances of a given concept. AQ15 is a conceptual inductive learning program that uses feature-based examples of concepts to generate rules which describe the underlying concept. This program has been successfully applied to a wide variety of domains. We have been exploring the use o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000